﻿using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Linq;

namespace ProjectEuler.Problems
{
    [EulerProblem(18, 1074)]
    [Description("Find the maximum sum travelling from the top of the triangle to the base.")]
    internal sealed class Problem018 : EulerProblem
    {
        public override Object Solve()
        {
            return new NumberTriangle(Triangle).MaxSum();
        }

        private readonly Int32[][] Triangle = new[]
        {
            new[] { 04, 62, 98, 27, 23, 09, 70, 98, 73, 93, 38, 53, 60, 04, 23 },
            new[] { 63, 66, 04, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31 },
            new[] { 91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48 },
            new[] { 70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57 },
            new[] { 53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14 },
            new[] { 41, 48, 72, 33, 47, 32, 37, 16, 94, 29 },
            new[] { 41, 41, 26, 56, 83, 40, 80, 70, 33 },
            new[] { 99, 65, 04, 28, 06, 16, 70, 92 },
            new[] { 88, 02, 77, 73, 07, 63, 67 },
            new[] { 19, 01, 23, 75, 03, 34 },
            new[] { 20, 04, 82, 47, 65 },
            new[] { 18, 35, 87, 10 },
            new[] { 17, 47, 82 },
            new[] { 95, 64 },
            new[] { 75 },
        };
    }
}
